402B - Trees in a Row - CodeForces Solution

#include <iostream>
#include <vector>


using namespace std;

int main() {
    int n, k;
    cin >> n >> k;

    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int minCount = n;
    int v0;
    for (int i = 1; i <= 1000; i++) {
        int count = 0;
        for (int j = 0; j < n; j++) {
            int h = i + k * j;
            if (h != v[j])
                count++;
        }
        if (minCount > count) {
            minCount = count;
            v0 = i;
        }
    }
    cout << minCount << endl;
    for (int i = 0; i < n; i++) {
        int h = v0 + k * i;
        if (h != v[i]) {
            cout << (h > v[i] ? '+' : '-') << ' ';
            cout << i + 1 << ' ' << abs(h - v[i]) << endl;
        }
    }


    return 0;
}